Dimensionally Guided Synthesis of Mathematical Word Problems

نویسندگان

  • Ke Wang
  • Zhendong Su
چکیده

Mathematical Word Problems (MWPs) are important for training students’ literacy and numeracy skills. Traditionally MWPs have been manually designed; an effective automated MWP generator can significantly benefit education and research. The goal of this work is to efficiently synthesize MWPs that are authentic (i.e., similar to manually written problems), diverse (i.e., covering a wide range of mathematical tasks), and configurable (i.e., varying difficulty levels and solution characteristics). This is challenging because a generated problem needs to both exhibit a well-founded mathematical structure and also an easily understood natural language story. Our key insight is to leverage the important role that dimensional units play in MWPs, both textually and symbolically. We first synthesize a dimensionally consistent equation and then compose the natural language story via a bottom-up traversal of the equation tree. We have realized our technique and extensively evaluated its efficiency and effectiveness. Results show that the system can generate hundreds of valid problems per second with varying levels of difficulty. More importantly, we show, via a user study with 30 students from a local middle school, that the generated problems are statistically indistinguishable from actual textbook problems for practice and examination.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The characteristics of mathematical word problems at the middle school and suggested strategies to facilitae their solution process

Abstract: This paper, first it has reviewed the literature on the characteristics of mathematical word problems and their solution process. The review revealed that among the root causes for students’ difficulties with mathematical word problems, two factors are salient, namely the text complexity and the unfamiliar context. To shed more light on these findings, a factorial experimental study w...

متن کامل

Construction and Validation of a Questionnaire on Metacognitive Knowledge Needed in Solving Mathematical Word Problems to be Used in Interviews

To provide researchers with an instrument, valid and reliable enough, for measuring students’ metacognitive knowledge needed in solving mathematical word problems, based on the theoretical foundation and previous research, a set of 24 questions at three levels of metacognitive knowledge was constructed. The initial validity of these questions was confirmed by Psychology Professors and high scho...

متن کامل

Mathematical Modeling for a Flexible Manufacturing Scheduling Problem in an Intelligent Transportation System

This paper presents a new mathematical model for a production system through a scheduling problem considering a material handling system as an intelligent transportation system by automated guided vehicles (AGVs). The traditional systems cannot respond to the changes and customer’s demands and for this reason, a flexible production system is used. Therefore, for this purpose, automated transpor...

متن کامل

MULTI-OBJECTIVE ROUTING AND SCHEDULING IN FLEXIBLE MANUFACTURING SYSTEMS UNDER UNCERTAINTY

The efficiency of transportation system management plays an important role in the planning and operation efficiency of flexible manufacturing systems. Automated Guided Vehicles (AGV) are part of diversified and advanced techniques in the field of material transportation which have many applications today and act as an intermediary between operating and storage equipment and are routed and contr...

متن کامل

Reconciling Enumerative and Symbolic Search in Syntax-Guided Synthesis

Syntax-guided synthesis aims to find a program satisfying semantic specification as well as user-provided structural hypothesis. For syntax-guided synthesis there are two main search strategies: concrete search, which systematically or stochastically enumerates all possible solutions, and symbolic search, which interacts with a constraint solver to solve the synthesis problem. In this paper, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016